Supercomputer Environment for Recursive Matrix Algorithms

A new runtime environment for the execution of recursive matrix algorithms on a supercomputer with distributed memory is proposed. It designed both dense and sparse matrices. The ensures decentralized control computation process. As an example block algorithm, Cholesky factorization symmetric positive definite in form dichotomous algorithm described. results experiments different numbers cores are presented, demonstrating good scalability proposed solution.